Backup Path Restoration Design using Path Generation Technique
نویسنده
چکیده
In this work, we present a flow restoration based network design problem where we assume the knowledge of possible failure situations. We use the idea of a situation disjoint path couple (nominal path, backup path) which are constructed in such a way that atleast one of them is operational in any given failure situation for a flow. We present a linear programming formulation of the problem and use path generation technique (based on column generation) to solve the same for large networks. The path generation approach is an iterative method that allows us to add path couples with greater discretion, based on dual Lagrangean multipliers in every iteration. We consider four different scenarios that differ in the way we compute and add new path couples at every iteration. We present the results of our approach for an example network. From our observations, we conclude that path generation approach is an effective method to solve the backup path restoration design problem.
منابع مشابه
Spare Capacity Allocation for Non-Linear Link Cost and Failure-Dependent Path Restoration
The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi-constraint optimization problem, called spare capacity allocation (SCA). This paper presents a m...
متن کاملPath-based protection for surviving double-link failures in mesh-restorable optical networks
we consider path-based protection methods for twolink failures in mesh optical networks. Two link-disjoint backup paths are pre-computed for each source and destination node pair. We identify the scenarios where the backup paths can share their wavelengths without violating 100% restoration guarantee (backup multiplexing). We use integer programming to optimize the total capacity requirement fo...
متن کاملDesign of a Fast Restoration Mechanism for Virtual Path-Based ATM Networks
ln this paper, we propose a fast restoration mechanism for virtual path-based ATM networks. Given an ATM network topology, the capacity of each physical link, and the primary virtual path (VP) layout at system initialization, the proposed mechanism pre-assigns to each primary VP one backup VP such that (PI) the failure of a single node/link does not lead to the failure of both the primary and b...
متن کاملEfficient Bandwidth Allocation for Backup Paths
In MPLS networks, failure resilience of a Label Switched Path (LSP) is essential in guaranteeing the QoS of the path. This can be achieved by allocating backup LSPs through which packets can be routed in case of primary LSP failiures. bandwidth efficiency and expeditious path restoration are two desirable features for the design of backup LSPs. This paper tackles the bandwidth efficiency with a...
متن کاملOn the effectiveness of restoration path computation methods
In this piece of work, we compare the effectiveness of distributed restoration path computation methods that use head-end precomputation and do not use backup path sharing. Our aim is to provide statistics on primary and secondary path lengths of simple disjoint path computation methods in real-world network topologies. Moreover, we propose a path computation method which can be used when paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003